Matroids and Graphs with Few Non-Essential Elements

نویسندگان

  • James G. Oxley
  • Haidong Wu
چکیده

An essential element of a 3–connected matroid M is one for which neither the deletion nor the contraction is 3–connected. Tutte’s Wheels and Whirls Theorem proves that the only 3–connected matroids in which every element is essential are the wheels and whirls. In an earlier paper, the authors showed that a 3–connected matroid with at least one non-essential element has at least two such elements. This paper completely determines all 3–connected matroids with exactly two non-essential elements. Furthermore, it is proved that every 3–connected matroid M for which no single-element contraction is 3–connected can be constructed from a similar such matroid whose rank equals the rank in M of the set of elements e for which the deletion M\e is

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matroids and graphs with few non-essential edges

Finally, Theorem 1.2 is quite straightforward to deduce from Corollary 5.4. Alternatively , it is not diicult to prove this theorem directly using Theorem 2.1. We conclude by presenting the rst of these proofs. Proof of Theorem 1.2. From the list given in Corollary 5.4 of binary 3{connected matroids whose set of non-essential elements has rank two, we eliminate the ma-troids under (i) and (iii)...

متن کامل

On the Structure of 3-connected Matroids and Graphs

An element e of a 3-connected matroid M is essential if neither the deletion M\e nor the contraction M/e is 3-connected. Tutte’s Wheels and Whirls Theorem proves that the only 3-connected matroids in which every element is essential are the wheels and whirls. In this paper, we consider those 3-connected matroids that have some non-essential elements, showing that every such matroid M must have ...

متن کامل

Structural properties of fuzzy graphs

Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study  connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids  from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...

متن کامل

Energy of Graphs, Matroids and Fibonacci Numbers

The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.

متن کامل

On the decomposition of ternary matroids

Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of dependence. Matroids generalize linear dependence over vector spaces, and they also abstract the properties of graphs, in the former case they are called Vector Matroids, in the latter they are called Graphic Matroids [3]. The operation of Matroid Union was introduced by Nash-Williams in 1966. A matroid is i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Graphs and Combinatorics

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2000